Two-Dimensional Parameterized Matching
نویسندگان
چکیده
منابع مشابه
Parameterized Matching
Two equal length strings s and s, over alphabets Σs and Σs′ , parameterize match if there exists a bijection π : Σs → Σs′ , such that π(s) = s, where π(s) is the renaming of each character of s via π. Parameterized matching is the problem of finding all parameterized matches of a pattern string p in a text t. It was introduced as a model for software duplication detection in software maintenanc...
متن کاملTwo-Dimensional Dictionary Matching
Most traditional pattern matching algorithms solve the problem of finding all occurrences of a given pattern string P in a given text T . Another important paradigm is the dictionary matching problem. Let D = {P1, ..., Pk} be the dictionary. We seek all locations of dictionary patterns that appear in a given text T . Previous dictionary matching algorithms have all involved exact matching of a ...
متن کاملTwo Dimensional Matching 11
There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithms for two dimensional matching have needed stronger models of computation...
متن کاملTwo Dimensional Matching 10.1 Exact Matching
String matching is a basic theoretical problem in computer science, but has been useful in implementating various text editing tasks. The explosion of multimedia requires an appropriate generalization of string matching to higher dimensions. The rst natural generalization is that of seeking the occurrences of a pattern in a text where both pattern and text are rectangles. The last few years saw...
متن کاملTwo Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is presented, and shown to be effective at solving problems where the point sets are related by a projective transformation. Random starts local search is shown to be capable of solving very difficult point matching problems, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2014
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2650220